Lazy Database Access with Persistent Predicates
نویسندگان
چکیده
منابع مشابه
Lazy Database Access with Persistent Predicates ? Sebastian
Programmers need mechanisms to store application specific data that persists multiple program runs. To accomplish this task, they usually have to deal with storage specific code to access files or relational databases. Functional logic programming provides a natural framework to transparent persistent storage through persistent predicates, i.e., predicates with externally stored facts. We exten...
متن کاملLazy SETL Debugging with Persistent Data Structures
To my parents and v Acknowledgments This is a good opportunity for me to thank the people who have contributed to the thesis. It is difficult to imagine that I could complete my research work without the contributions of these people. I am greatly indebted to my research advisor, Jack Schwartz. He has been my mentor and motivator since I started to work with him three years ago. His interest, i...
متن کاملVectorizing Database Column Scans with Complex Predicates
The performance of the full table scan is critical for the overall performance of column-store database systems such as the SAP HANA database. Compressing the underlying column data format is both an advantage and a challenge, because it reduces the data volume involved in a scan on one hand and introduces the need for decompression during the scan on the other hand. In previous work [26] we ha...
متن کاملUser defined topological predicates in database systems
Current database systems cannot only store standard data like integer , string , and real values, but also spatial data like points , lines, and regions . The importance of topological relationships between spatial objects has been recognized a long time ago. Using the well known 9 intersection model for describing such relationships, a lot of constellations can be distinguished. For the query ...
متن کاملImplementing Lazy Database Updates for an Object Database System
Current object database management systems support user-defined conversion functions to update the database once the schema has been modified. Two main strategies are possible when implementing such database conversion functions: immediate or lasy database updates. In this paper, we concentrate our attention to the definition of implementation strategies for conversion functions implemented as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.01.024